Genetic Chromodynamics for Obtaining Continuous Representation of Pareto Regions

نویسندگان

  • D. DUMITRESCU
  • CRINA GROS
  • MIHAI OLTEAN
چکیده

In [5] an evolutionary algorithm for detecting continuous Pareto optimal sets has been proposed. In this paper we propose a new evolutionary elitist approach combing a non-standard solution representation and an evolutionary optimization technique. The proposed method permits detection of continuous decision regions. In our approach an individual (a solution) is either a closed interval or a point. The individuals in the final population give a realistic representation of Pareto optimal set. Each solution in this population corresponds to a decision region of Pareto optimal set. Proposed technique is an elitist one. It uses a unique population. Current population contains nondominated solutions already founded.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Entropy-based multi-objective genetic algorithm for design optimization

Obtaining a fullest possible representation of solutions to a multiobjective optimization problem has been a major concern in Multi-Objective Genetic Algorithms (MOGAs). This is because a MOGA, due to its very nature, can only produce a discrete representation of Pareto solutions to a multiobjective optimization problem that usually tend to group into clusters. This paper presents a new MOGA, o...

متن کامل

Multi-Objective Genetic Algoirthms With Concepts from Statistical Thermodynamics

Obtaining the fullest possible representation of solutions to a multi-objective optimization problem has been a major concern in MultiObjective Genetic Algorithms (MOGAs). This is because a MOGA, due to its nature, usually produces several clusters of solutions that does not cover the whole range of Pareto frontier. This poster paper indroduces an overview of a new approach, one that aims at ob...

متن کامل

Minimizing the total tardiness and makespan in an open shop scheduling problem with sequence-dependent setup times

We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several mult...

متن کامل

Scheduling a constellation of agile earth observation satellites with preemption

In this paper, we consider a scheduling problem for a set of agile Earth observation satellites for scanning  different parts of the Earth’s surface. We assume that preemption is allowed to prevent repetitive images and develop four different preemption policies. Scheduling is done for the imaging time window and transmission time domain to the Earth stations as well. The value of each picture ...

متن کامل

Approximation of fixed points for a continuous representation of nonexpansive mappings in Hilbert spaces

This paper introduces an implicit scheme for a   continuous representation of nonexpansive mappings on a closed convex subset of a Hilbert space with respect to a   sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup.   The main result is to    prove the strong convergence of the proposed implicit scheme to the unique solutio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001